An Adapted Variable Neighborhood Search based algorithm for the cyclic multi-hoist design and scheduling problem

This paper studies both the design and cyclic scheduling of multi-hoist treatment surface facilities. Former research have always assumed that production line is already available with a fixed material handling fleet size. However, in this study, number hoists considered as decision variable problem. The latter then bi-objective called Cyclic Hoist Design Scheduling Problem (CHDSP). optimization objective to determine an optimal schedule for each possible minimizes cycle time thus maximizes throughput rate. achieved results will contribute building support system enable choose required transportation resources regarding aims productivity maximization cost savings. An original encoding approach proposed assigns generates their move sequences, which are evaluated thanks mixed integer linear programming model. A rich well-structured solving algorithm based on neighborhood search developed adapted solve efficiently whole It also improved by backtrack procedure further enhances findings. Computational experiments conducted benchmark problems demonstrate high performance effectiveness was, most cases, even able reach solutions.